Partitioning digraphs with outdegree at least 4
نویسندگان
چکیده
Scott asked the question of determining c d such that if D is a digraph with m arcs and minimum outdegree ? 2 then V ( ) has partition 1 , min { e } m, where (respectively, number from to ). Lee, Loh, Sudakov showed = ? 6 + o 3 5 conjectured ? for 4. In this paper, we show 4 14 prove some partial results 5.
منابع مشابه
Short Cycles in Digraphs with Local Average Outdegree at Least Two
Suppose G is a strongly connected digraph with order n girth g and diameter d. We prove that d + g ≤ n if G contains no arcs (u, v) with deg(u) = 1 and deg(v) ≤ 2. Caccetta and Häggkvist showed in 1978 that any digraph of order n with minimum outdegree 2 contains a cycle of length at most dn/2e. Applying the abovementioned result, we improve their result by replacing the minimum outdegree condi...
متن کاملA note on complete subdivisions in digraphs of large outdegree
Mader conjectured that for all ` there is an integer δ(`) such that every digraph of minimum outdegree at least δ(`) contains a subdivision of a transitive tournament of order `. In this note we observe that if the minimum outdegree of a digraph is sufficiently large compared to its order then one can even guarantee a subdivision of a large complete digraph. More precisely, let ~ G be a digraph...
متن کاملOn non-Hamiltonian circulant digraphs of outdegree three
We construct infinitely many connected, circulant digraphs of outdegree three that have no hamiltonian circuit. All of our examples have an even number of vertices, and our examples are of two types: either every vertex in the digraph is adjacent to two diametrically opposite vertices, or every vertex is adjacent to the vertex diametrically opposite to itself.
متن کاملEulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
A colored eulerian digraph is an eulerian digraph G where a color is assigned to the tail of each edge and a color is assigned to the head of each edge. A compatible circuit is an eulerian circuit such that for every two consecutive edges uv and vw of the circuit, the color of the head of uv is different from the color of the tail of vw. Let S3 be the set of vertices of outdegree and indegree t...
متن کاملStrengthened Brooks' Theorem for Digraphs of Girth at least Three
Brooks’ Theorem states that a connected graph G of maximum degree ∆ has chromatic number at most ∆, unless G is an odd cycle or a complete graph. A result of Johansson shows that if G is triangle-free, then the chromatic number drops to O(∆/ log∆). In this paper, we derive a weak analog for the chromatic number of digraphs. We show that every (loopless) digraph D without directed cycles of leng...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2021
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22715